Congruences for the Fishburn Numbers

نویسندگان

  • GEORGE E. ANDREWS
  • Wen-Ching Winnie Li
چکیده

The Fishburn numbers, ξ(n), are defined by a formal power series expansion ∞ ∑ n=0 ξ(n)q = 1 + ∞ ∑ n=1 n ∏ j=1 (1− (1− q)). For half of the primes p, there is a non–empty set of numbers T (p) lying in [0, p− 1] such that if j ∈ T (p), then for all n ≥ 0, ξ(pn+ j) ≡ 0 (mod p). 2010 Mathematics Subject Classification: 05A19, 11F20, 11P83

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congruences and relations for r-Fishburn numbers

Recently Andrews and Sellers proved some amazing congruences for the Fishburn numbers. We extend their results to a more general sequence of numbers. As a result we prove a new congruence mod 23 for the Fishburn numbers and prove their conjectured mod 5 congruence for a related sequence. We also extend and prove some unpublished conjectures of Garthwaite and Rhoades.

متن کامل

Congruences for Taylor Expansions of Quantum Modular Forms

Abstract. Recently, a beautiful paper of Andrews and Sellers has established linear congruences for the Fishburn numbers modulo an infinite set of primes. Since then, a number of authors have proven refined results, for example, extending all of these congruences to arbitrary powers of the primes involved. Here, we take a different perspective and explain the general theory of such congruences ...

متن کامل

Two New Interpretations of the Fishburn Numbers and Their Refined Generating Functions

We show that two classes of combinatorial objects–inversion tables with no subsequence of decreasing consecutive numbers and matchings with no 2-nestings–are enumerated by the Fishburn numbers. In particular, we give a simple bijection between matchings with no 2-nestings and inversion tables with no subsequence of decreasing consecutive numbers. We then prove using the involution principle tha...

متن کامل

Combinatorial Structures and Generating Functions of Fishburn Numbers, Parking Functions, and Tesler Matrices

COMBINATORIAL STRUCTURES AND GENERATING FUNCTIONS OF FISHBURN NUMBERS, PARKING FUNCTIONS, AND TESLER MATRICES. Paul Levande James Haglund This dissertation reflects the author’s work on two problems involving combinatorial structures. The first section, which was also published in the Journal of Combinatorial Theory, Series A, discusses the author’s work on several conjectures relating to the F...

متن کامل

Some Congruences for Central Binomial Sums Involving Fibonacci and Lucas Numbers

We present several polynomial congruences about sums with central binomial coefficients and harmonic numbers. In the final section we collect some new congruences involving Fibonacci and Lucas numbers.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014